On Perfect Matchings in k-Complexes
نویسندگان
چکیده
منابع مشابه
Perfect Fractional Matchings in $k$-Out Hypergraphs
Extending the notion of (random) k-out graphs, we consider when the k-out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each r there is a k = k(r) such that the k-out r-uniform hypergraph on n vertices has a perfect fractional matching with high probability (i.e., with probability tending to 1 as n → ∞) and prove an analogous result for r-uniform r-...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملOriented Euler Complexes and Signed Perfect Matchings
This paper presents “oriented pivoting systems” as an abstract framework for complementary pivoting. It gives a unified simple proof that the endpoints of complementary pivoting paths have opposite sign. A special case are the Nash equilibria of a bimatrix game at the ends of Lemke–Howson paths, which have opposite index. For Euler complexes or “oiks”, an orientation is defined which extends th...
متن کاملSome perfect matchings and perfect half-integral matchings in NC
We show that for any class of bipartite graphs which is closed under edge deletion and where the number of perfect matchings can be counted in NC, there is a deterministic NC algorithm for finding a perfect matching. In particular, a perfect matching can be found in NC for planar bipartite graphs and K3,3-free bipartite graphs via this approach. A crucial ingredient is part of an interior-point...
متن کاملPerfect Matchings and Perfect Powers
In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers (N. Elkies et al., J. Algebraic Combin. 1 (1992), 111– 132; B.-Y. Yang, Ph.D. thesis, Department of Mathematics, MIT, Cambridge, MA, 1991; J. Propp, New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999). In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2020
ISSN: 1073-7928,1687-0247
DOI: 10.1093/imrn/rnz343